Predefined-time distributed multiobjective optimization for network resource allocation
نویسندگان
چکیده
We consider the multiobjective optimization problem for resource allocation of multiagent network, where each agent contains multiple conflicting local objective functions. The goal is to find compromise solutions minimizing all functions subject constraints as much possible, i.e., Pareto optimums. To this end, we first reformulate into one single-objective distributed by using weighted Lp preference index, weighting factors are obtained from procedure so that optimizer latter desired optimum former. Next, propose novel predefined-time algorithms solve reformulated time-based generators. show solved within a predefined time if strongly convex and smooth. Moreover, settling can be arbitrarily preset since it does not depend on initial values designed parameters. Finally, numerical simulations presented illustrate effectiveness proposed algorithms.
منابع مشابه
Optimization of Resource Allocation in the Distributed Production Network
The development of the stochastic approach, based on queuing modelling and simulation, to solve the problem of resource decentralization in the distributed production network (DPN) is examined in the paper. The problem of performance optimisation of DPN is formulated as task of non-linear integer programming with stochastic parameters. A branch and bound algorithm, based on sequential use of qu...
متن کاملResource Allocation Optimization for Heterogeneous Network
The improvement of communication throughput using a cross layer mode of communication is proposed. Due to critical mode of applications of sensor networks, it is required to achieve data at faster rate for high refreshment. As the communicating data’s are sensed or measured data, it is required to have higherthroughput and less interference, to achieve accuracy and optimal resource utilization....
متن کاملCommunication Complexity of Distributed Resource Allocation Optimization
This paper investigates the communication complexity of distributed resource allocation problems. Communication complexity, which has emerged from computer science, measures the minimal number of communicated bits needed to solve some classes of problems regardless of the used algorithm, when the communication is lossless. We introduce two complexity measures for finding primal/dual saddle poin...
متن کاملDistributed Newton-type Algorithms for Network Resource Allocation
Most of today's communication networks are large-scale and comprise of agents with local information and heterogeneous preferences, making centralized control and coordination impractical. This motivated much interest in developing and studying distributed algorithms for network resource allocation problems, such as Internet routing, data collection and processing in sensor networks, and cross-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2023
ISSN: ['1869-1919', '1674-733X']
DOI: https://doi.org/10.1007/s11432-022-3791-8